Planar and Plane Slope Number of Partial 2-Trees
نویسندگان
چکیده
We prove tight bounds (up to a small multiplicative or additive constant) for the plane and the planar slope numbers of partial 2-trees of bounded degree. As a byproduct of our techniques, we answer a long standing question by Garg and Tamassia about the angular resolution of the planar straight-line drawings of series-parallel graphs of bounded degree.
منابع مشابه
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct edge-slopes in such a drawing of a planar graph with maximum degree Δ. We show that the planar slope number of every series-parallel graph of maximum degree three is three. We also show that the plan...
متن کاملar X iv : c s / 04 05 11 2 v 1 [ cs . D M ] 3 1 M ay 2 00 4 Really Straight Graph Drawings ∗
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 5n/2 segments and at most 2n slopes. We prove that every cubic 3-connected plane graph has a plane drawing ...
متن کاملar X iv : c s . D M / 0 40 51 12 v 1 3 1 M ay 2 00 4 Really Straight Graph Drawings ∗
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 5n/2 segments and at most 2n slopes. We prove that every cubic 3-connected plane graph has a plane drawing ...
متن کاملDrawing Outer 1-planar Graphs with Few Slopes
A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and each edge is crossed by at most another edge. Outer 1-planar graphs are a superclass of the outerplanar graphs and a subclass of the planar partial 3-trees. We show that an outer 1-planar graph G of bounded degree ∆ admits an outer 1-planar straight-line drawing that uses O(∆) different slopes, which gen...
متن کاملEffect of tree decline and slope aspect on the leaf morphological traits of Persian oak trees
This study was accomplished with the aim of investigating the effects of tree decline and slope aspect on leaf morphological traits and determining the indicator morphological traits that indicate the leaf diversity of Persian oak trees in relation to habitat conditions and environmental stresses in Mellah Siah forests of Ilam. Two forest habitats were selected on the northern and southern slop...
متن کامل